COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.CB CARTESIAN PRODUCT SEARCH SPACES
C00004 ENDMK
C⊗;
.CB CARTESIAN PRODUCT SEARCH SPACES


	Let ⊗A be a space within which we wish to find a path from
an initial point ⊗S0 to a point satisfying a goal predicate ⊗G(s). 
Nilsson (1970) discusses the general problem of search and discusses
various heuristics, and we assume the reader is familiar with this
discussion or its equivalent.

	Besides the general methods discussed by Nilsson, there seems
to be a rather general additional class of search methods that are usable
when the search space is described as a Cartesian product, and the
function that gives the successors of a position and the goal
predicate has certain forms when described using the components.

	Our first interest is in picking off the cases in which
a problem can be decomposed into several problems that can be
tackled independently.